On L∞-morphisms of Cyclic Chains
نویسندگان
چکیده
Recently the first two authors [1] constructed an L∞-morphism using the S1-equivariant version of the Poisson Sigma Model (PSM). Its role in deformation quantization was not entirely clear. We give here a “good” interpretation and show that the resulting formality statement is equivalent to formality on cyclic chains as conjectured by Tsygan and proved recently by several authors [5], [10].
منابع مشابه
L∞-morphisms of Cyclic Chains
Recently the first two authors [1] constructed an L∞-morphism using the S1-equivariant version of the Poisson Sigma Model (PSM). Its role in deformation quantization was not entirely clear. We give here a “good” interpretation and show that the resulting formality statement is equivalent to formality on cyclic chains as conjectured by Tsygan and proved recently by several authors [5], [9].
متن کاملOn morphisms of crossed polymodules
In this paper, we prove that the category of crossed polymodules (i.e. crossed modules of polygroups) and their morphisms is finitely complete. We, therefore, generalize the group theoretical case of this completeness property of crossed modules.
متن کاملClassification of coset-preserving skew-morphisms of finite cyclic groups
The concept of a coset-preserving skew-morphism is a generalization of the widely studied t-balanced skew-morphisms of regular Cayley maps which are in turn generalizations of group automorphisms. In case of abelian groups, all skew-morphisms of regular Cayley maps are roots of coset-preserving skew-morphisms, and therefore, classification of cosetpreserving skew-morphisms of finite abelian gro...
متن کاملA classification of hull operators in archimedean lattice-ordered groups with unit
The category, or class of algebras, in the title is denoted by $bf W$. A hull operator (ho) in $bf W$ is a reflection in the category consisting of $bf W$ objects with only essential embeddings as morphisms. The proper class of all of these is $bf hoW$. The bounded monocoreflection in $bf W$ is denoted $B$. We classify the ho's by their interaction with $B$ as follows. A ``word'' is a function ...
متن کاملMorphisms on Marked Graphs
Abstract. Many kinds of morphisms on Petri nets have been defined and studied. They can be used as formal techniques supporting refinement/abstraction of models. In this paper we introduce a new notion of morphism on marked graphs, a class of Petri nets used for the representation of systems having deterministic behavior. Such morphisms can indeed be used to represent a form of abstraction on m...
متن کامل